Model Checking of Probabilistic and Nondeterministic Systems
نویسندگان
چکیده
The temporal logics pCTL and pCTL* have been proposed as tools for the formal speci cation and veri cation of probabilistic systems: as they can express quantitative bounds on the probability of system evolutions, they can be used to specify system properties such as reliability and performance. In this paper, we present model-checking algorithms for extensions of pCTL and pCTL* to systems in which the probabilistic behavior coexists with nondeterminism, and show that these algorithms have polynomial-time complexity in the size of the system. This provides a practical tool for reasoning on the reliability and performance of parallel systems.
منابع مشابه
Model Checking Durational Probabilistic Systems
We consider model-checking algorithms for durational probabilistic systems, which are systems exhibiting nondeterministic, probabilistic and discrete-timed behaviour. We present two semantics for durational probabilistic systems, and show how formulae of the probabilistic and timed temporal logic PTCTL can be verified on such systems. We also address complexity issues, in particular identifying...
متن کاملVerifying Nondeterministic Channel Systems With Probabilistic Message Losses
Lossy channel systems (LCS’s) are systems of finite state automata that communicate via unreliable unbounded fifo channels. In order to circumvent the undecidability of model checking for nondeterministic LCS’s, probabilistic models have been introduced, where it can be decided whether a linear-time property holds almost surely. However, such fully probabilistic systems are not a faithful model...
متن کاملSymbolic Model Checking of Concurrent Probabilistic Systems Using MTBDDs and Simplex∗
Symbolic model checking for purely probabilistic processes using MTBDDs [12] was introduced in [4] and further developed in [20, 3]. In this paper we consider models for concurrent probabilistic systems similar to those of [28, 7, 5] and the concurrent Markov chains of [35, 13], which extend the purely probabilistic processes through the addition of nondeterministic choice. As a specification f...
متن کاملSymbolic Model Checking of Concurrent Probabilistic Systems Using MTBDDs and the Simplex Algorithm
Symbolic model checking for purely probabilistic processes using MTB-DDs 12] was introduced in 4] and further developed in 20, 3]. In this paper we consider models for concurrent probabilistic systems similar to those of 28, 7, 5] and the concurrent Markov chains of 35, 13], which extend the purely probabilistic processes through the addition of nondeterministic choice. As a speciication formal...
متن کاملSymbolic Model Checking of Probabilistic Processes Using MTBDDs and the Kronecker Representation
This paper reports on experimental results with symbolic model checking of probabilistic processes based on Multi-Terminal Binary Decision Diagrams (MTBDDs). We consider concurrent probabilistic systems as models; these allow nondeterministic choice between probability distributions and are particularly well suited to modelling distributed systems with probabilistic behaviour, e.g. randomized c...
متن کاملProbabilistic CTL*: The Deductive Way
Complex probabilistic temporal behaviours need to be guaranteed in robotics and various other control domains, as well as in the context of families of randomized protocols. At its core, this entails checking infinite-state probabilistic systems with respect to quantitative properties specified in probabilistic temporal logics. Model checking methods are not directly applicable to infinite-stat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995